for _ in range(int(input())):
s = input()
for k, c in enumerate(s):
if c == '1':
break
ans = t = 0
for i in range(k + 1, len(s)):
if s[i] == '0':
t += 1
else:
ans += t
t = 0
print(ans)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,f,cnt;
cin >> t;
while(t--)
{
string s;
cin >> s;
f=cnt=0;
stack<char>st;
for(int i=0;i<s.size();i++)
{
if(st.empty())
{
st.push(s[i]);
if(s[i]=='1')
f=1;
}
else
{
if(f)
{
while(st.top()<s[i])
{
st.pop();
cnt++;
}
st.push(s[i]);
}
else
{
st.push(s[i]);
if(s[i]-'0'==1)
f=1;
}
}
}
cout << cnt << endl;
}
return 0;
}
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |